class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
         int n = text1.length() ;
         int m = text2.length() ;
         text1 = " "+text1 ;
         text2 = " " + text2 ;
         char[] arr1 = text1.toCharArray() ;
         char[] arr2 = text2.toCharArray() ;
         int[][] dp = new int[n+1][m+1] ; 
         for(int i=1 ; i <= n ; i ++){
            for(int j=1 ; j <= m ; j ++){
                 if(arr1[i] == arr2[j]){
                   dp[i][j] = dp[i-1][j-1]+1 ;
                 }else{
                   dp[i][j] = Math.max(dp[i-1][j] , dp[i][j-1]) ; 
                 }
            }
         }
          return dp[n][m] ; 
    }
}